/*
 * @Author: long-xinyu2 2192763423@qq.com
 * @Date: 2025-03-11 18:47:55
 * @LastEditors: long-xinyu2 2192763423@qq.com
 * @LastEditTime: 2025-05-13 18:42:22
 * @FilePath: \algorithm\algorithm-training\2025_3_11.cpp
 * @Description: 这是默认设置,请设置`customMade`, 打开koroFileHeader查看配置 进行设置: https://github.com/OBKoro1/koro1FileHeader/wiki/%E9%85%8D%E7%BD%AE
 */
#include<iostream>
#include<cstring>
#include<vector>
#include<map>
#include<cstdio>
#include<algorithm>
#include<string>
#include<string.h>
#include<queue>
#include<math.h>
#include<set>
#include<functional>
using namespace std;
using ull = unsigned long long;
#define int long long
//using i128 = __int128_t;
inline int inc(int x, int v, int mod) { x += v;return x >= mod ? x - mod : x; }//代替取模+
#define endl '\n'
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;

const int N = 2e3 + 10, M = 1e5 + 10;

inline int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
        x = x * 10 + ch - '0', ch = getchar();
    return x * f;
}


void solve()
{
    string s1,s2;
    cin >> s1 >> s2;
    s1 = ' ' + s1;
    s2 = ' ' + s2;
    vector<pair<int,int>> ans1;
    vector<pair<int,int>> ans2;
    int op2 = 0; 
    int op = 1;
    if(s1[1] == 'L') op2 = 1;
    else op2 = 2;
    for(int i = 2; i < s1.size(); i++)
    {
        if(s1[i] == s1[i - 1])
        {
            op++;
        }
        else 
        {
            ans1.push_back({op,op2});
            op = 1;
            if(op2 == 1) op2 = 2;
            else op2 = 1;
        }
    }
    ans1.push_back({op,op2});
    op = 1;
    if(s2[1] == 'L') op2 = 1;
    else op2 = 2;
    for(int i = 2; i < s2.size(); i++)
    {
        if(s2[i] == s2[i - 1])
        {
            op++;
        }
        else 
        {
            ans2.push_back({op,op2});
            op = 1;
            if(op2 == 1) op2 = 2;
            else op2 = 1;
        }
    }
    ans2.push_back({op,op2});
    if(ans1.size() != ans2.size())
    {
        cout << "No" << endl;
        return;
    }
    for(int i = 0; i < ans1.size(); i++)
    {
        if(ans1[i].second != ans2[i].second || ans1[i].first * 2 < ans2[i].first || ans1[i].first > ans2[i].first)
        {
            cout << "No" << endl;
            return;
        }
    }
    cout << "Yes" << endl;
    
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int tt;
    cin >> tt;
    //tt = 1;
    while (tt--)
    {
        solve();
    }
}